Memory shapes

ABSTRACT

A user definition of a memory shape can be received and a multidimensional, contiguous, physical portion of a memory array can be allocated according to the memory shape. The user definition of the memory shape can include a quantity of contiguous columns of the memory array, a quantity of contiguous rows of the memory array, and a major dimension of the memory shape. The major dimension can correspond to a dimension by which to initially stride data stored in the memory shape.

TECHNICAL FIELD

The present disclosure relates generally to semiconductor memory and methods, and more particularly, to multidimensional, contiguous, physical allocation of a memory device via use of memory shapes.

BACKGROUND

Memory devices are typically provided as internal, semiconductor, integrated circuits in computing systems or other electronic devices. There are many different types of memory including volatile and non-volatile memory. Volatile memory can require power to maintain its data (e.g., user data, error data, etc.) and includes random-access memory (RAM), dynamic random access memory (DRAM), and synchronous dynamic random access memory (SDRAM), among others. Non-volatile memory can provide persistent data by retaining stored data when not powered and can include non-volatile random access memory (NVRAM), NAND flash memory, NOR flash memory, read only memory (ROM), Electrically Erasable Programmable ROM (EEPROM), Erasable Programmable ROM (EPROM), and resistance variable memory such as phase change random access memory (PCRAM), resistive random access memory (RRAM), and magnetoresistive random access memory (MRAM), such as spin torque transfer random access memory (STT RAM), among others.

Computing systems often include a number of processing resources (e.g., one or more processors), which may retrieve and execute instructions and store the results of the executed instructions to a suitable location. A processing resource can comprise a number of functional units (e.g., herein referred to as functional unit circuitry (FUC)) such as arithmetic logic unit (ALU) circuitry, floating point unit (FPU) circuitry, and/or a combinatorial logic block, for example, which can execute instructions to perform logical operations such as AND, OR, NOT, NAND, NOR, and XOR logical operations on data (e.g., one or more operands).

A number of components in a computing system may be involved in providing instructions to the functional unit circuitry for execution. The instructions may be generated, for instance, by a processing resource such as a controller and/or host processing resource. Data (e.g., the operands on which the instructions will be executed to perform the logical operations) may be stored in a memory array that is accessible by the FUC. The instructions and/or data may be retrieved from the memory array and sequenced and/or buffered before the FUC begins to execute instructions on the data. Furthermore, as different types of operations may be executed in one or multiple clock cycles through the FUC, intermediate results of the operations and/or data may also be sequenced and/or buffered. In many instances, the processing resources (e.g., processor and/or associated FUC) may be external to the memory array, and data can be accessed (e.g., via a bus between the processing resources and the memory array to execute instructions). Data can be moved from the memory array to registers external to the memory array via a bus.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 illustrates a block diagram of an apparatus in the form of a computing system including at least one memory system in accordance with a number of embodiments of the present disclosure.

FIG. 2 illustrates a schematic diagram of a portion of a memory device illustrating a multidimensional, contiguous, physical allocation according to a memory shape in accordance with a number of embodiments of the present disclosure.

FIG. 3 illustrates a schematic diagram of a portion of a memory device illustrating a multidimensional, contiguous, physical allocation according to a memory shape in accordance with a number of embodiments of the present disclosure.

FIG. 4 illustrates a schematic diagram of a portion of a memory device illustrating a multidimensional, contiguous, physical allocation according to a plurality of memory shapes in accordance with a number of embodiments of the present disclosure.

FIG. 5 illustrates a schematic diagram of a portion of a memory device illustrating a multidimensional, contiguous, physical allocation according to a plurality of memory shapes for an outer loop optimization in accordance with a number of embodiments of the present disclosure.

FIG. 6 illustrates a schematic diagram of a portion of a memory device illustrating a multidimensional, contiguous, physical allocation according to an array of memory shapes for an outer loop optimization in accordance with a number of embodiments of the present disclosure.

FIG. 7 is a schematic diagram illustrating sensing circuitry in accordance with a number of embodiments of the present disclosure.

FIG. 8 is a logic table illustrating selectable logic operation results implemented by sensing circuitry in accordance with a number of embodiments of the present disclosure.

DETAILED DESCRIPTION

In some approaches to allocating memory, operating systems (OSs) may provide a method for organizing allocated memory blocks in physical space. With respect to this discussion, an “allocated memory block” refers to the location in physical memory where amount of allocated memory (e.g., a quantity of bytes) is stored. For example, the calloc( ) function allocates a specified number of bytes and initializes them to zero, which assures that all bytes of the allocated memory block have been initialized to zero. The calloc( ) function can identify a size in bytes of a single variable and a number of the variables to be allocated in memory. However, the organization of memory blocks may be one-dimensional (e.g., entirely linear). That is, memory blocks can be organized such that data is stored to a plurality of memory cells coupled to contiguous sense lines but a single access line. A one-dimensional physical memory allocation may support the bandwidth of a host processor across a diverse set of applications running on the host. To that end, a one-dimensional physical memory allocation may increase memory bandwidth from a host processor. The allocated memory blocks may be distributed linearly across multiple memory banks or memory devices (e.g., interleaved across multiple memory banks or memory devices). Thus, users may be limited to allocating memory blocks according to the one-dimensional physical memory allocation. As used herein, “users” refer to programmers as opposed to an end-user.

Recent advances in memory technology, for example, processing in memory, can benefit from multidimensional allocation of memory. That is, a multidimensional allocation of memory can include a plurality of memory cells coupled to contiguous sense lines and contiguous access lines of a single memory array. Thus it may be advantageous to allocate physically contiguous portions of memory array in multiple dimensions. However, the notions of multidimensional allocation of memory do not fit current models of one-dimensional memory allocation. If memory is allocated physically in one dimension then the performance of a PIM device may be degraded because of inherent inability to co-locate data elements in the same physical memory component. Overall system performance may also be degraded if a virtual memory allocation does not take into account multidimensional memory arrangement. For a PIM device to operate on data stored in a memory allocation, the data must be physically organized in the same physical memory component (e.g., memory bank, memory device, etc.) or be moved to that physical organization before/during the operation. This can be because of the coupling of the sensing circuitry to the memory array such that data is operated on a column-by-column basis. Thus, the physical layout and orientation of individually allocated memory blocks may affect the performance of the PIM device.

To overcome limitations on physical organization of data of one-dimensional memory allocation, the present disclosure is related to storing data in a multidimensional, contiguous, physical allocation of a memory array. A user-defined multidimensional, contiguous, physical allocation of memory is herein referred to as a memory shape. A definition of the memory shape by a user can include a quantity of contiguous columns of the memory array, a quantity of contiguous rows of the memory array, and a major dimension of the memory shape. The major dimension, either a horizontal major dimension or a vertical major dimension, can determine the first dimension by which to stride the data stored in the memory shape. Examples of major dimensions are discussed further below in association with FIGS. 2 and 3. A user (e.g., programmer) can define a memory shape such that the definition of a memory shape is a user definition of a memory shape.

Memory can be allocated to contiguous, physical portions of a memory array. Such an allocation is hereinafter referred to as a memory shape. Memory shapes can enable a user (e.g., a programmer) to explicitly define the dimensional structure and layout of a target memory allocation. Memory shapes can be advantageous when the memory is allocated for use by a processing in memory (PIM) device. Co-locating data items in a same physical memory component (e.g., memory bank, memory device, etc.) via memory shapes can improve the performance of the PIM device and the overall performance of a system comprising the PIM device. Thus, memory shapes can promote a performance-optimized memory organization for PIM devices.

A number of embodiments of the present disclosure can promote improved data locality between data elements and within the data elements by storing data elements in a memory shape. As used herein, “data element” refers to a group of bits that represents a data value such as an integer, a floating point, or a string. As used herein, “storing a data element in a memory shape” refers to storing the data element in one or more memory cells coupled to access lines and sense lines of the memory shape. The definition of a memory shape exceeds that of the one-dimensional physical organization, which only includes the size of the memory allocation and the size of the individual data elements of the memory allocation. A number of embodiments can include storing more than one type of data element (e.g., integers, floating points, strings, etc.) in a single memory shape. A multidimensional, contiguous, physical portion of a memory array can be allocated according to more than one memory shape. Storing data elements in one or more memory shapes can reduce the communication between multiple memory banks or memory devices. As a result, the bandwidth of a host processor can be increased because the data elements are stored such that the host processor does not need to communicate with multiple memory banks or memory devices. A number of embodiments can include performing an operation on data stored in a memory shape.

A memory shape can include a number of memory cells to store at least one entire data element in the memory shape. For example, if a length of a data element is four bytes of physical memory, then the memory shape can include a number of memory cells necessary to store the four bytes of the data element. However, the memory shape can include a number of memory cells that exceeds that necessary to store the four bytes of the data element. The major dimension of a memory shape can be aligned with the length of a data element. For example, if a memory shape includes 1024 data elements that are one byte in length, the number of columns of the memory shape for a horizontal major dimension or the number of rows of the memory shape for a vertical major dimension can be multiples of one byte. An operation can be performed on one or more data element of a memory shape (e.g., performing the operation within the memory shape). An operation can be performed data elements of multiple memory shapes (e.g., performing the operation between the multiple memory shapes).

In the following detailed description of the present disclosure, reference is made to the accompanying drawings that form a part hereof, and in which is shown by way of illustration how a number of embodiments of the disclosure may be practiced. These embodiments are described in sufficient detail to enable those of ordinary skill in the art to practice the embodiments of this disclosure, and it is to be understood that other embodiments may be utilized and that process, electrical, and/or structural changes may be made without departing from the scope of the present disclosure. As used herein, the designators “A”, “B”, “C”, “M”, “N”, “S”, and “X”, particularly with respect to reference numerals in the drawings, indicates that a number of the particular feature so designated can be included. As used herein, “a number of” a particular thing can refer to one or more of such things (e.g., a number of memory devices can refer to one or more memory devices). As used herein, the terms “first” and “second” are used to differentiate between one feature from another and do not necessarily imply an order between the features so designated.

The figures herein follow a numbering convention in which the first digit or digits correspond to the drawing figure number and the remaining digits identify an element or component in the drawing. Similar elements or components between different figures may be identified by the use of similar digits. For example, 240 may reference element “40” in FIG. 2, and a similar element may be referenced as 340 in FIG. 3. Multiple analogous elements within one figure may be referenced with a reference numeral followed by a hyphen and another numeral or a letter. For example, 240-1 may reference element 40-1 in FIGS. 2 and 240-X may reference element 40-X, which can be analogous to element 440-1. Such analogous elements may be generally referenced without the hyphen and extra numeral or letter. For example, elements 240-1, . . . , 240-X may be generally referenced as 240. As will be appreciated, elements shown in the various embodiments herein can be added, exchanged, and/or eliminated so as to provide a number of additional embodiments of the present disclosure. In addition, as will be appreciated, the proportion and the relative scale of the elements provided in the figures are intended to illustrate certain embodiments of the present invention, and should not be taken in a limiting sense.

FIG. 1 illustrates a block diagram of an apparatus in the form of a computing system 100 including at least one memory system 104 in accordance with a number of embodiments of the present disclosure. As used herein, a host 102, a memory system 104, a memory device 110, a memory array 111, and/or sensing circuitry 124 might also be separately considered an “apparatus.”

The computing system 100 can include a host 102 coupled to memory system 104, which includes a memory device 110 (e.g., including a memory array 111 and/or sensing circuitry 124). The host 102 can be a host system such as a personal laptop computer, a desktop computer, a digital camera, a mobile telephone, or a memory card reader, among various other types of hosts. In some embodiments, the host 102 can be or include a memory management unit. A memory management unit is a hardware component that performs translation between virtual memory addresses and physical memory addresses. The host 102 can include a system motherboard and/or backplane and can include a number of processing resources (e.g., one or more processors, microprocessors, or some other type of controlling circuitry). The computing system 100 can include separate integrated circuits or both the host 102 and the memory system 104 can be on the same integrated circuit. The computing system 100 can be, for instance, a server system and/or a high performance computing system and/or a portion thereof. Although the example shown in FIG. 1 illustrates a system having a Von Neumann architecture, embodiments of the present disclosure can be implemented in non-Von Neumann architectures (e.g., a Turing machine), which may not include one or more components (e.g., CPU, ALU, etc.) often associated with a Von Neumann architecture.

For clarity, the computing system 100 has been simplified to focus on features with particular relevance to the present disclosure. The memory array 111 can be a hybrid memory cube (HMC), processing in memory random access memory (PIMRAM) array, DRAM array, SRAM array, STT RAM array, PCRAM array, TRAM array, RRAM array, NVRAM array, NAND flash array, and/or NOR flash array, for instance. The memory array 111 can comprise memory cells arranged in rows coupled by access lines (which may be referred to herein as word lines or select lines) and columns coupled by sense lines (which may be referred to herein as digit lines or data lines). Although a single memory device 110 is shown in FIG. 1, embodiments are not so limited. For instance, memory system 104 may include a number of memory devices 110 (e.g., a number of banks of DRAM cells).

The memory device 110 can be a multidimensional random access memory. A dimension of memory is a coordinate that can be used to specify a location within the memory (e.g., the location of a memory cell or allocable portion of memory). Examples of dimensions of a memory include rows, columns, layers (e.g., in the case of a hybrid memory cube), banks, chips, etc. A memory can have more than three dimensions in terms of coordinates. For example, a memory device 110 can include multiple memory channels (a first dimension of the memory device is a channel), each channel including multiple memory dies (a second dimension of the memory device 110 is a die), each die including multiple subarrays (a third dimension of the memory device 110 is a subarray), and each subarray including multiple rows (a fourth dimension of the memory is a row). Some embodiments are described herein with respect to a two-dimensional memory device for ease of illustration and explanation however embodiments are not so limited. One of ordinary skill in the art, having read and understood the present disclosure can apply the teachings to a memory device 110 having more than two dimensions.

The memory system 104 can include address circuitry 126 to latch address signals provided over an I/O bus 138 (e.g., a data bus) through I/O circuitry 130. Address signals can be received and decoded by a row decoder 128 and a column decoder 134 to access the memory device 110. Data can be read from the memory array 111 by sensing voltage and/or current changes on the sense lines using sensing circuitry 124. The sensing circuitry 124 can read and latch a page (e.g., row) of data from the memory array 111. The I/O circuitry 130 can be used for bi-directional data communication with host 102 over the I/O bus 138. The write circuitry 132 can be used to write data to the memory device 110.

Controller 108 can decode signals provided by control bus 136 from the host 102. These signals can include chip enable signals, write enable signals, and address latch signals that are used to control operations performed on the memory device 110, including data read, data write, and data erase operations. In various embodiments, the controller 108 is responsible for executing instructions from the host 102. The controller 108 can be a state machine, a sequencer, a processor, and/or other control circuitry.

The host 102 can be configured with an operating system “OS” 112. The host 102 can be coupled to the memory device 110 (e.g., via the control bus 136 and/or the I/O bus 138. The OS 112 is executable instructions (software) that manages hardware resources and provides services other executable instructions (programs) that run on the OS 112. The OS 112 can include instructions to respond to a received user definition of a memory shape. The user definition of the memory shape can be an allocation of a multidimensional, contiguous, physical portion of a memory array, as described herein. The user definition of the memory shape can originate from the host 102 (e.g., from a program running on the host 102) among other originations (e.g., from a direct memory access (DMA) device).

The host 102 can be configured to receive the user definition of a memory shape, receive the user definition of a quantity of the memory shapes, allocate contiguous columns and contiguous rows of memory cells of a single physical memory component of the memory device according to the user definitions, and store a plurality of data elements contiguously in the single physical memory component of the memory device 110 according to the user definitions. The host 102 can be configured to allocate the contiguous columns and contiguous rows of memory cells of the single physical memory component such that each of the memory shapes comprises memory cells coupled to common access lines. The host 102 can be configured to address (e.g., a vector-style address) each memory shape individually such that the operation is performed on data elements stored in particular memory shape. Although not illustrated in FIG. 1, the host can include a memory allocation application program interface (API) configured to receive the user definitions.

An example of the sensing circuitry 124 is described further below in association with FIG. 2. For instance, in a number of embodiments, the sensing circuitry 124 can comprise a number of sense amplifiers and a number of compute components, which may comprise latch serving as an accumulator and can be used to perform operations (e.g., on data associated with complementary sense lines) such as logical operations. Logical operations can include Boolean operations (e.g., AND, OR, NOR, XOR, etc.) as well as combinations of Boolean operations to perform other mathematical operations. In a number of embodiments, the sensing circuitry 124 can be used to perform logical operations using data stored in the memory array 111 as inputs and store the results of the logical operations back to the memory array 111 without transferring via a sense line address access (e.g., without firing a column decode signal). As such, a logical operation can be performed using sensing circuitry 124 rather than and/or in addition to being performed by processing resources external to the sensing circuitry 124 (e.g., by a processor associated with host 102 and/or other processing circuitry, such as ALU circuitry, located on the memory system 104, such as on the controller 108, or elsewhere).

In various previous approaches, data associated with a logical operation, for instance, would be read from memory via sensing circuitry and provided to an external ALU. The external ALU circuitry would perform the logical operations using the elements (which may be referred to as operands or inputs) and the result could be transferred back to the array via the local I/O lines. In contrast, in a number of embodiments of the present disclosure, sensing circuitry 124 can be configured to perform a logical operation on data stored in memory cells in memory array 111 and store the result back to the array 111 without enabling a local I/O line coupled to the sensing circuitry.

The sensing circuitry 124 can be configured to perform an operation on at least one of the plurality of data elements stored in a memory shape. The sensing circuitry 124 can be configured to perform an operation on a first data element of a first memory shape and perform an operation on a second data element of a second memory shape. The sensing circuitry 124 can be configured to perform the operation on a first data element and a second data element of a particular memory shape. The sensing circuitry 124 can be configured to perform the operation on the plurality of data elements concurrently.

As such, in a number of embodiments, registers and/or an ALU external to the memory array 111 and sensing circuitry 124 may not be needed to perform the logical operation as the sensing circuitry 124 can be operated to perform the logical operation using the address space of memory array 111. Additionally, the logical operation can be performed without the use of an external processing resource.

FIG. 2 illustrates a schematic diagram of a portion of a memory device 210 illustrating a multidimensional, contiguous, physical allocation according to a memory shape 260 in accordance with a number of embodiments of the present disclosure. The memory device 210 can include a memory array 211 that includes the memory cells 240 (represented by the filled-in circles) coupled to the rows of access lines 242-1, 242-2, 242-3, 242-4, 242-5, 242-6, 242-7, . . . , 242-M and the columns of sense lines 244-1, 244-2, 244-3, 244-4, 244-5, 244-6, 244-7, 244-8, . . . , 244-N. The memory array 211 is not limited to a particular number of access lines and/or sense lines, and use of the terms “rows” and “columns” does not intend a particular physical structure and/or orientation of the access lines and/or sense lines. Although not pictured, each column of memory cells can be associated with a corresponding pair of complementary sense lines. An example where each column of memory cells is associated with a corresponding pair of complementary sense lines is discussed further below in association with FIG. 7.

The memory shape 260 is denoted by a box encompassing a group of the memory cells 240 coupled to the access lines 242-1 to 242-6 and the sense lines 244-1 to 244-6. That is, the memory shape 260 is a 6×6 memory shape comprising six adjacent rows of the memory cells 240 and six adjacent columns of the memory cells 240. As used herein, “a row of memory cells” may refer to a subset of the memory cells coupled to an access line and “a column of memory cells” may refer to a subset of the memory cells coupled to a sense line. The major dimension of the memory shape 260 is a vertical major dimension as indicated by the arrow 261. Because the major dimension is a vertical major dimension, the stride within the memory shape 260 can begin with transferring data to or from the memory cell 240-1, then transferring data to or from the memory cell 240-2, and so on such that data is transferred to or from the memory cells 240-1 to 240-6 coupled to the sense line 244-1 before data is transferred to or from the memory cells coupled to the sense line 244-2 beginning with the memory cell 240-7.

An example of pseudo code for defining a memory shape as a programming language data structure (e.g., a C struct) can be summarized as follows:

//- shape structure struct_mcs_shape_t{    unsigned _rows; //- quantity of contiguous rows    unsigned _cols; //- quantity of contiguous coluimns    unsigned _major; //- 0x00 indicates a vertical major dimension //- 0x01 indicates a horizontal major dimension } An example of pseudo code of a program function (e.g., a macro) for users (e.g., programmers) to allocate a multidimensional, contiguous, physical portion of a memory array according to a memory shape, as defined above, as follows:

//- shape macro #define MAJOR_VERTICAL 0x00 #define MAJOR_HORIZONTAL 0x01 #define _shape( NAME, R, C, M) \    { struct _mcs_shape_t NAME = {._rows = R, \    ._cols = C, ._major = M}; } For example, a user can allocate a multidimensional, contiguous, physical portion of the memory array 211 according to the memory shape 260 via the program function “shape” described above:

_shape(MY_SHAPE,6,6,MAJOR_VERTICAL)

A data element can be stored in the memory cells corresponding to each of the contiguous columns of the memory shape 260. For example, a data element can be stored in the memory cells 240-1 to 240-6, which correspond to the first column of the memory shape 260. The data element can be one of several types of data elements including but not limited to an integer, a floating point, or a string. Another data element, of the same type as or a different type than the data element stored in the first column, can be stored in a group of the memory cells 240 coupled to the sense line 244-2 and the access lines 242-1 to 242-6 corresponding to the second column of the memory shape 260.

Another data element of the same length as or a different length than the data element stored in the first column of the memory shape 260 can be stored in the second column of the memory shape 260. For example, a first data element can be stored in six of the memory cells 240 coupled to the access lines 242-1 to 242-6 and the sense line 244-1 of the first column of the memory shape 260. A second data element can be stored in four of the memory cells 240 coupled to the access lines 242-1 to 242-4 and the sense line 244-2 of the second column of the memory shape 260.

In at least one embodiment padding can be stored in memory cells of a memory shape when a data element of a length less than the length of the major dimension of the memory shape is stored in the memory shape. As used herein, “padding” refers to bits stored in memory cells of a memory shape that are not storing bits of a data element. For example, if a data element is stored in the memory cells 240-1 to 240-4 of the memory shape 260, then padding can be stored in the memory cells 240-5 and 240-6 of the memory shape 260. The length of the padding (e.g., the quantity of bits) can be equal to the difference of the length of the first data element and the length of the second data element.

Each column of memory cells can be coupled to sensing circuitry 224, which can be analogous to sensing circuitry 124 illustrated in FIG. 1. In this example, the sensing circuitry includes a number of sense amplifiers 246-1, 246-2, 246-3, 246-4, 246-5, 246-6, 246-7, 246-8, . . . , 246-N coupled to the respective sense lines 244. The sense amplifiers 246 are coupled to input/output (I/O) line 254 (e.g., a local I/O line) via access devices (e.g., transistors) 250-1, 250-2, 250-3, 250-4, 250-5, 250-6, 250-7, 250-8, . . . , 250-N. In this example, the sensing circuitry 224 also includes a number of compute components 248-1, 248-2, 248-3, 248-4, 248-5, 248-6, 248-7, 248-8, . . . , 248-N coupled to the respective sense lines 244. Column decode lines 252-1, 252-2, 252-3, 252-4, 252-5, 252-6, 252-7, 252-8, . . . , 252-N are coupled to the gates of transistors 250 respectively, and can be selectively activated to transfer data sensed by respective sense amps 246 and/or stored in respective compute components 248 to a secondary sense amplifier 256. In a number of embodiments, the compute components 248 can be formed on pitch with the memory cells of their corresponding columns and/or with the corresponding sense amplifiers 246.

In a number of embodiments, the sensing circuitry (e.g., compute components 248 and sense amplifiers 246) is configured to perform a number of operations (e.g., logical operations) on data stored in the memory array 211. As an example, a first data element can be stored in a first group of memory cells coupled to a particular access line (e.g., access line 242-1) and to a number of sense lines 244, and a second data element can be stored in a second group of memory cells coupled to a different access line (e.g., access line 242-2) and the respective number of sense lines 244. Each memory cell 240 can store a bit of the first data element or the second data element. For example, each bit of the first data element can have a logical operation performed thereon with a respective bit of the second data element. The result of the logical operation can be stored (e.g., as a bit-vector) in a third group of memory cells coupled to a particular access line (e.g., access line 242-3) and to the number of sense lines 244.

A number of embodiments can include a memory array 211 including many (e.g., thousands) of the sense lines 244. According to the present disclosure, a logical operation can be performed on the many memory elements associated with the many (e.g., thousands) of the sense lines 244 in parallel in memory (e.g., without transferring the data out of the array, such as to a processing resource). Such embodiments can save a significant amount of time that would otherwise be required if the data was transferred to a processing resource to perform the logical operations (e.g., at 64 bits per clock cycle). Further advantages can be realized by allocating a multidimensional, contiguous, physical portion of a memory array before the logical operation is performed so that there is no stall in the performance of the logical operation in memory in order to align data and/or allocate a temporary allocable portion of memory (e.g., allocate a temporary row of memory).

FIG. 3 illustrates a schematic diagram of a portion of a memory device 310 illustrating a multidimensional, contiguous, physical allocation according to a memory shape 362 in accordance with a number of embodiments of the present disclosure. The portion of the memory device 310 can be analogous to the portion of the memory device 210 illustrated in FIG. 2. The memory shape 362 is denoted by a box encompassing a group of the memory cells 340 (represented by the filled-in circles) coupled to the access lines 342-1 to 342-6 and the sense lines 344-1 to 344-6. That is, the memory shape 362 is a 6×6 memory shape comprising six contiguous rows of the memory cells 340 and six contiguous columns of the memory cells 340. The major dimension of the memory shape 362 is a horizontal major dimension as indicated by the arrow 363. Because the major dimension is a horizontal major dimension, the stride within the memory shape can begin with transferring data to or from the memory cell 340-1, then transferring data to or from the memory cell 340-2, and so on such that data is transferred to or from the memory cells 340-1 to 340-6 coupled to the access line 342-1 before data is transferred to or from the memory cells coupled to the access line 342-2 beginning with the memory cell 340-7.

For example, a user can allocate a multidimensional, contiguous, physical portion of the memory array 311 according to the memory shape 362 via the program function “shape” described above:

_shape(MY_SHAPE,6,6,MAJOR_HORIZONTAL)

A data element can be stored in the memory cells corresponding to each of the contiguous rows of the memory shape 362. For example, a data element can be stored in the memory cells 340-1 to 340-6, which correspond to the first row of the memory shape 362. The data element can be one of several types of data elements including but not limited to an integer, a floating point, or a string. Another data element, of the same type as or a different type than the data element stored in the first column, can be stored in a group of the memory cells 340 coupled to the access line 342-2 and the sense lines 344-1 to 344-6 corresponding to the second column of the memory shape 362.

FIG. 4 illustrates a schematic diagram of a portion of a memory device illustrating a multidimensional, contiguous, physical allocation according to a plurality of memory shapes 464-1 to 464-3 in accordance with a number of embodiments of the present disclosure. The portion of the memory device 410 can be analogous to the portion of the memory device 210 illustrated in FIG. 2. The plurality of memory shapes 464-1 to 464-3 are contiguous as denoted by the boxes encompassing groups of the memory cells (represented by the filled-in circles) coupled to the access lines 442-1 to 442-6 and the sense lines 444-1 to 444-9. That is, each of the plurality of memory shapes 464-1 to 464-3 is a 6×3 memory shape comprising six contiguous rows of the memory cells and three contiguous columns of the memory cells such that the memory shape 464-1 includes the memory cells coupled to the access lines 442-1 to 442-6 and the sense lines 444-1 to 444-3, the memory shape 464-2 includes the memory cells coupled to the access lines 442-1 to 442-6 and the sense lines 444-4 to 444-6, and the memory shape 464-3 includes the memory cells coupled to the access lines 442-1 to 442-6 and the sense lines 444-7 to 444-9. The major dimension of each of the plurality of memory shapes 464-1 to 464-3 is a vertical major dimension as indicated by the arrows 461-1 to 461-3.

The memory shape to memory shape stride from one memory shape (e.g., the memory shape 464-1) to another memory shape (e.g., the memory shape 464-2) can be horizontal as indicated by the arrow 465. Although the plurality of memory shapes can have a vertical memory shape to memory shape stride such that the plurality of memory shapes are vertically adjacent, a horizontal memory shape to memory shape stride such that the plurality of memory shapes are horizontally adjacent can overcome the physical constraints of a memory array. One such physical constraint can be that the quantity of access lines (e.g., the quantity of rows of memory cells) is less than the quantity of sense lines (e.g., the quantity of columns of memory cells). For example, a memory array may have 512 or 1024 access lines but have thousands of the sense lines 444. In previous approaches, data elements may be wrapped such that a data element begins in one column, or row, and ends in a different column, or row. Some columns may be masked because data elements may not be stored in adjacent columns in contrast to at least one embodiment in accordance with the present disclosure. That is, masking may not be necessary to exclude undesired data from being operated on because the data elements are stored in adjacent columns or rows.

A plurality of memory shapes with a vertical major dimension can improve the overall performance of a system, such as the system 100 illustrated in FIG. 1. By storing a data element in each column of a memory shape, the sensing circuity, such as the sensing circuitry 424, can be used efficiently such that communication between the physical memory components (e.g., memory device, memory bank, etc.) of a memory device is decreased. Additionally, throughput of a single physical memory component can be increased because a greater portion of the available sensing circuity is utilized. That is, storing a data element in each column of a memory shape spreads the data elements amongst the sense amplifiers and compute components.

In at least one embodiment, string-type data elements, such as character strings, can be stored in a memory shape. Each of the character strings can comprise characters. A character can be a predefined programming language data structure comprising a byte of data (eight bits of data). For example, a character string can comprise two characters or sixteen bits of data. A multidimensional, contiguous, physical portion of a memory array can be allocated according to a memory shape such that the memory shape includes four of the character strings. If the memory shape has a vertical major dimension, then each of the four character strings can be stored in a column of the memory shape. Thus, four contiguous columns and sixteen contiguous rows of a memory array can be assigned to a 16×4 memory shape. The allocation can enable an operation to be performed on the four data elements of each memory shape concurrently in a single instruction, multiple data (SIMD) fashion. If the allocation includes more than one of the memory shapes, then the operation can be performed on the four data elements of all of the memory shapes concurrently. The following pseudo code can be used to define the four data elements, each comprising two characters:

struct data{    char sentence[4][2]; //-- four character strings, each comprising //-- two characters }; The pseudo code program function “shape” described above in association with FIG. 2 can be used to allocate a multidimensional, contiguous, physical portion of a memory array according to a 16×4 memory shape as follows:

shape(MY_SHAPE,16,4,MAJOR_VERTICAL);

A multidimensional, contiguous, physical portion of a memory array can be allocated according to a plurality of memory shapes, such as the plurality of memory shapes 464-1 to 464-3 illustrated in FIG. 4. Different methods can be utilized to allocate the multidimensional, contiguous, physical portion of a memory array according to the plurality of memory shapes. A first method can include mapping existing data to the plurality of memory shapes. The existing data can be mapped from a different physical memory component of a single memory device, a disk external to the memory device, or the same memory array that will store the mapped data elements. The first method can utilize a memory allocation API to allocate a plurality of memory shapes. An example of pseudo code for allocating a multidimensional, contiguous, physical portion of a memory array according to a plurality of memory shapes can be summarized as follows:

void*mcs_shape_mmap(size_t nmemb,mcs_shape_t shape);

where “nmemb” is the quantity of a previously defined memory shape. For example, three of the memory shape “MY_SHAPE” as defined above can be assigned to a pointer of a particular type using the pseudo code as follows:

struct data*mydataptr=mcs_shape_mmap(3,MY_SHAPE);

A second method can include allocating contiguous rows and contiguous columns of a physical memory component of a memory array in which data will be stored. The second method can be referred to as user-space accommodations. In contrast to the first method where existing data is mapped to the plurality of memory shapes, the second method allocates the memory shapes for future use. The second method can include allocating three of the memory shape “MY_SHAPE” as defined above using the pseudo code as follows:

struct data*mydata=NULL;

mydata=mcs_calloc_shape(3,sizeof(struct data),MY_SHAPE);

At least one embodiment in accordance with the present disclosure can be used in conjunction with a database, such as that used for medical records, because memory shapes can provide the ability to perform an operation on a particular data element of a memory shape, which can correspond to a particular field of the database. For example, a data element corresponding to each field of a medical records database can be stored in each column of a memory shape. Each of a plurality of memory shapes can correspond to a patient's records. For example, a first string-type data element corresponding to a patient's last name can be stored in the respective first column of the memory shape. A second string-type data element corresponding to the patient's first name can be stored in the respective second column of the memory shape. A first integer-type data element corresponding to the patient's zip code can be stored in the respective third column of the memory shape. A second integer-type data element corresponding to the patient's phone number can be stored in the respective fourth column of the memory shape. If, for example, the medical records for only those patients living in a particular zip code are needed, then an operation can be performed on the data elements stored in the respective third columns of the plurality of memory shapes.

FIG. 5 illustrates a schematic diagram of a portion of a memory device illustrating a multidimensional, contiguous, physical allocation according to a plurality of memory shapes for an outer loop optimization in accordance with a number of embodiments of the present disclosure. The outer loop optimization can include performing an operation on the data elements of the plurality of memory shapes according to a user-defined sequence. The user-defined sequence can indicate which data elements on which to perform the operation. The user-defined sequence can indicate a subset of the plurality of memory shapes and a subset of the contiguous columns or the contiguous rows of the plurality of memory shapes.

At least one embodiment can include receiving a user-defined quantity of contiguous rows of a memory shape and a user-defined quantity of contiguous columns of the memory shape, receiving a user-defined quantity of memory shapes, allocating a contiguous, multidimensional portion of a single physical memory component of a memory device according to the user-defined quantities, storing a plurality of data elements in the contiguous, multidimensional portion such that the plurality of data elements are in a common orientation, and performing an operation on each of the plurality of data elements according to a user-defined sequence. The user-defined sequence can include performing the operation on each of the plurality of data elements of a first memory shape and subsequently performing the operation on each of the plurality of data elements of a second memory shape.

The plurality of data elements can be oriented vertically such that one of the plurality of data elements can be stored in each of the contiguous columns as illustrated in FIG. 5. The user-defined sequence can include performing the operation on a first data element of a respective first column of the first memory shape, subsequently performing the operation on a second data element of a respective second column of the respective first memory shape, subsequently performing the operation on a third data element of a respective first column of the second memory shape, and subsequently performing the operation on a fourth data element of a respective second column of the second memory shape. The respective first column of a memory shape can be adjacent to the respective second column of the memory shape.

The plurality of data elements can be oriented horizontally such that one of the plurality of data elements can be stored in each of the contiguous rows as illustrated in FIG. 6. The user-defined sequence can include performing the operation on a first data element of a respective first row of the first memory shape, subsequently performing the operation on a second data element of a respective second row of the respective first memory shape, subsequently performing the operation on a third data element of a respective first row of the second memory shape, and subsequently performing the operation on a fourth data element of a respective second row of the second memory shape. The respective first row of a memory shape can be adjacent to the respective second row of the memory shape.

FIG. 5 illustrates three memory shapes 564-1 to 564-3, which can be analogous to the plurality of the memory shapes 464-1 to 464-3 illustrated in FIG. 4. Each of the memory shapes 564-1 to 564-3 has a vertical major dimension as indicated by the arrows 561-1 to 561-3. A first index (e.g., “i”) can correspond to a particular one of the memory shapes 564-1 to 564-3. For example, i=0 can correspond to the memory shape 564-1, i=1 can correspond to the memory shape 564-2, and i=2 can correspond to the memory shape 564-3. A second index (e.g., “j”) can correspond to a particular sentence of the memory shapes 564-1 to 564-3. As used herein, a “sentence” refers to a column of a memory shape if the memory shape has a vertical major dimension or a row of a memory shape if the memory shape has a horizontal major dimension. As illustrated in FIG. 5, j=0 can correspond to a respective first column of the memory shape 564-1 (e.g, for i=0, the memory cells (represented by the filled-in circles) coupled to the sense line 544-1 and the access lines 542-1 to 542-6), j=1 can correspond to a respective second column of the memory shape 564-1 (e.g, for i=0, the memory cells coupled to the sense line 544-2 and the access lines 542-1 to 542-6), and j=2 can correspond to a respective third column of the memory shape 564-1 (e.g, for i=0, the memory cells coupled to the sense line 544-3 and the access lines 542-1 to 542-6). A data element can be stored in each column of a memory shape.

By using the first and second indices i and j, an operation can be performed on each data element stored in the columns of a first memory shape (e.g., the memory shape 564-1) before the operation is performed on each data element stored in the columns of a second memory shape (e.g., the memory shape 564-2). Alternatively, the first and second indices i and j can be used to perform an operation on a subset of the memory shapes, a subset of the data elements stored in the memory shapes, or both. Thus, each memory shape can be addressed individually such that the operation is performed on a group of the data elements of a particular memory shape of the plurality of memory shapes. The address can be a vector-style address that includes a starting address and an ending address. The vector-style address can include a starting address and an offset.

A user can use loop constructs that can be interpreted by a compiler to generate a single SIMD operation for an outer loop optimization. By using multidimensional, contiguous, physical allocation via memory shapes, a compiler can perform transformations and optimizations on code that would otherwise be difficult or unsafe despite the explicit definitions of stride and addressing of the compiler.

An example of pseudo code for an outer loop optimization can be summarized as follows:

int i, j; for( i=0; i<2; i++ ){ //-- for each memory shape    for( j=0; j<2; j++ ){ //-- for each sentence of a memory shape       //-- perform an operation on mydata[i].sentence[j]    } } According to the user-defined sequence of the example pseudo code above, an operation is performed on each data element, corresponding to each sentence j=0 through j=2, of a first memory shape (e.g., the memory shape 564-1), then on each data element, corresponding to each sentence j=0 through j=2, of a second memory shape (e.g., the memory shape 564-2), and then on each data element, corresponding to each sentence j=0 through j=2, of a third memory shape (e.g., the memory shape 564-3). The above pseudo code can used with a plurality of memory shapes that have a vertical major dimension as illustrated in FIG. 5 or a horizontal major dimension as illustrated in FIG. 6.

FIG. 6 illustrates a schematic diagram of a portion of a memory device illustrating a multidimensional, contiguous, physical allocation according to a plurality of memory shapes for an outer loop optimization in accordance with a number of embodiments of the present disclosure. FIG. 6 illustrates three memory shapes 666-1 to 666-3, which can be analogous to the plurality of the memory shapes 464-1 to 464-3 illustrated in FIG. 4 except each of the memory shapes 666-1 to 666-3 has a horizontal major dimension as indicated by the arrows 666-1 to 666-3. A first index (e.g., “i”) can correspond to a particular one of the memory shapes 666-1 to 666-3. For example, i=0 can correspond to the memory shape 666-1, i=1 can correspond to the memory shape 666-2, and i=2 can correspond to the memory shape 666-3. A second index (e.g., “j”) can correspond to a particular sentence of the memory shapes 666-1 to 666-3. As illustrated in FIG. 6, j=0 can correspond to a respective first row of the memory shape 666-1 (e.g, for i=0, the memory cells (represented by the filled-in circles) coupled to the access line 642-1 and the sense lines 644-1 to 644-3), j=1 can correspond to a respective second row of the memory shape 666-1 (e.g, for i=0, the memory cells coupled to the access line 642-2 and the sense lines 644-1 to 644-3), j=2 can correspond to a respective third row of the memory shape 666-1 (e.g, for i=0, the memory cells coupled to the access line 642-3 and the sense lines 644-1 to 644-3), j=3 can correspond to a respective fourth column of the memory shape 666-1 (e.g, for i=0, the memory cells coupled to the access line 642-4 and the sense lines 644-1 to 644-3), j=4 can correspond to a respective fifth column of the memory shape 666-1 (e.g, for i=0, the memory cells coupled to the access line 642-5 and the sense lines 644-1 to 644-3), and j=5 can correspond to a respective sixth column of the memory shape 666-1 (e.g, for i=0, the memory cells coupled to the access line 642-6 and the sense lines 644-1 to 644-3). A data element can be stored in each row of a memory shape.

By using the first and second indices i and j, an operation can be performed on each data element stored in the rows of a first memory shape (e.g., the memory shape 666-1) before the operation is performed on each data element stored in the rows of a second memory shape (e.g., the memory shape 666-2). Alternatively, the first and second indices i and j can be used to perform an operation on a subset of the memory shapes, a subset of the data elements stored in the memory shapes, or both. Thus, each memory shape can be addressed individually such that the operation is performed on a group of the data elements of a particular memory shape of the plurality of memory shapes. The address can be a vector-style address that includes a starting address and an ending address. The vector-style address can include a starting address and a stride.

FIG. 7 is a schematic diagram illustrating sensing circuitry 724 in accordance with a number of embodiments of the present disclosure. The sensing circuitry 724 can be analogous to the sensing circuitry 124 illustrated in FIG. 1. The sensing circuitry 724 can include a sense amplifier 746, which can be analogous to any of the sense amplifiers 246 illustrated in FIG. 2, and a compute component 748, which can be analogous to any of the compute components 248 illustrated in FIG. 2. FIG. 7 shows a sense amplifier 746 coupled to a pair of complementary sense lines 742 a and 742 b (which as a pair can be analogous to any of the sense lines 242 illustrated in FIG. 2). The compute component 748 is coupled to the sense amplifier 746 via the pass transistors 770-1 and 770-2. The gates of the pass transistors 770-1 and 770-2 can be controlled by a logical operation selection logic signal, PASS, which can be output from logical operation selection logic 772. FIG. 7 shows the compute component 748 labeled “A” and the sense amplifier 746 labeled “B” to indicate that the data value stored in the compute component 748 is the “A” data value and the data value stored in the sense amplifier 746 is the “B” data value shown in the logic tables illustrated with respect to FIG. 8.

The selectable logical operation selection logic 772 includes the swap transistors 776, as well as logic to drive the swap transistors 776. The logical operation selection logic 772 includes four logic selection transistors: a logic selection transistor 790 coupled between the gates of the swap transistors 776 and a TF signal control line, a logic selection transistor 792 coupled between the gates of the pass transistors 770-1 and 770-2 and a TT signal control line, a logic selection transistor 794 coupled between the gates of the pass transistors 770-1 and 770-2 and a FT signal control line, and a logic selection transistor 796 coupled between the gates of the swap transistors 776 and a FF signal control line. Gates of the logic selection transistors 790 and 792 are coupled to the true digit line 742 a through isolation transistor 774-1 (having a gate coupled to an ISO signal control line). Gates of the logic selection transistors 794 and 796 are coupled to the complementary digit line 742 b through the isolation transistor 774-2 (also having a gate coupled to an ISO signal control line).

As illustrated in FIG. 7, logic selection control signals can be applied to the logic selection transistors 790, 792, 794, and 796 to perform a particular logical operation. Operation of the logic selection transistors 790 and 796 are based on the state of the TF and FF selection signals and the data values on the respective complementary digit lines at the time the ISO signal is activated/deactivated. The logic selection transistors 790 and 796 also operate in a manner to control the swap transistors 776. For instance, to OPEN (e.g., turn on) the swap transistors 776, either the TF control signal is activated (e.g., high) with data value on the true digit line 742 a being “1,” or the FF control signal is activated (e.g., high) with the data value on the complement digit line 742 b being “1.” If either the respective control signal or the data value on the corresponding digit line (e.g., the digit line to which the gate of the particular logic selection transistor is coupled) is not high, then the swap transistors 776 will not be OPENed despite conduction of a particular logic selection transistor 790 and 796.

The PASS* control signal is not necessarily complementary to the PASS control signal. It is possible for the PASS and PASS* control signals to both be activated or both be deactivated at the same time. However, activation of both the PASS and PASS* control signals at the same time shorts the pair of complementary digit lines 742 a and 742 b together. Logical operations results for the sensing circuitry illustrated in FIG. 7 are summarized in the logic table illustrated in FIG. 8.

The sense amplifier 746 can, in conjunction with the compute component 748, be operated to perform various logical operations using data from an array as an input. In a number of embodiments, the result of a logical operation can be stored back to the array without transferring the data via a digit line address access (e.g., without firing a column decode signal such that data is transferred to circuitry external from the array and sensing circuitry via local I/O lines). As such, a number of embodiments of the present disclosure can enable performing logical operations and compute functions associated therewith using less power than various previous approaches. Additionally, since a number of embodiments can eliminate the need to transfer data across I/O lines in order to perform compute functions (e.g., between memory and discrete processor), a number of embodiments can enable an increased parallel processing capability as compared to previous approaches.

The sense amplifier 746 can further include equilibration circuitry, which can be configured to equilibrate the pair of complementary digit lines 742 a and 742 b. In this example, the equilibration circuitry comprises a transistor coupled between the pair of complementary digit lines 742 a and 742 b. The equilibration circuitry also comprises transistors each having a first source/drain region coupled to an equilibration voltage (e.g., V_(DD)/2), where V_(DD) is a supply voltage associated with the array. A second source/drain region of a transistor can be coupled to the digit line 742 a, and a second source/drain region of a transistor can be coupled to the digit line 742 b. Gates of the transistors can be coupled together, and to an equilibration (EQ) control signal line. As such, activating EQ enables the transistors, which effectively shorts the pair of complementary digit lines 742 a and 742 b together and to the equilibration voltage (e.g., V_(DD)/2).

Although FIG. 5 shows the sense amplifier 746 comprising the equilibration circuitry, embodiments are not so limited, and the equilibration circuitry may be implemented discretely from the sense amplifier 746, implemented in a different configuration than that shown in FIG. 7, or not implemented at all.

As shown in FIG. 7, the compute component 748 can also comprise a latch 791. The latch 791 can include a pair of cross coupled p-channel transistors (e.g., PMOS transistors) having their respective sources coupled to a supply voltage (e.g., V_(DD)). The latch 791 can include a pair of cross coupled n-channel transistors (e.g., NMOS transistors) having their respective sources selectively coupled to a reference voltage (e.g., ground), such that the latch 791 is continuously enabled. The configuration of the compute component 748 is not limited to that shown in FIG. 7.

FIG. 8 is a logic table illustrating selectable logic operation results implemented by sensing circuitry (e.g., the sensing circuitry 724 shown in FIG. 7) in accordance with a number of embodiments of the present disclosure. The four logic selection control signals (e.g., TF, TT, FT, and FF), in conjunction with a particular data value present on the complementary digit lines (e.g., the pair of complementary digit lines 742 a and 742 b shown in FIG. 7), can be used to select one of a plurality of logical operations to implement involving the starting data values stored in the sense amplifier 746 and the compute component 748. The four logic selection control signals (e.g., TF, TT, FT, and FF), in conjunction with a particular data value present on the complementary digit lines (e.g., on nodes S and S*), controls the pass transistors 770-1 and 770-2 and swap transistors 776, which in turn affects the data value in the compute component 748 and/or the sense amplifier 746 before/after firing. The capability to selectably control the swap transistors 776 facilitates implementing logical operations involving inverse data values (e.g., inverse operands and/or inverse result), among others.

Logic Table 8-1 illustrated in FIG. 8 shows the starting data value stored in the compute component 748 shown in column A at 871, and the starting data value stored in the sense amplifier 746 shown in column B at 873. The other three column headings in Logic Table 8-1 refer to the state of the pass transistors 770-1 and 770-2 and the swap transistors 776, which can respectively be controlled to be OPEN or CLOSED depending on the state of the four logic selection control signals (e.g., TF, TT, FT, and FF), in conjunction with a particular data value present on the pair of complementary digit lines 742 a and 742 b when the ISO control signal is asserted. The “NOT OPEN” column 875 corresponds to the pass transistors 770-1 and 770-2 and the swap transistors 776 both being in a non-conducting condition. The “OPEN TRUE” column 877 corresponds to the pass transistors 770-1 and 770-2 being in a conducting condition. The “OPEN INVERT” column 879 corresponds to the swap transistors 776 being in a conducting condition. The configuration corresponding to the pass transistors 770-1 and 770-2 and the swap transistors 776 both being in a conducting condition is not reflected in Logic Table 8-1 since this results in the digit lines being shorted together.

Via selective control of the pass transistors 770-1 and 770-2 and the swap transistors 776, each of the three columns 875, 877, and 879 of the upper portion of Logic Table 8-1 can be combined with each of the three columns 875, 877, and 879 of the lower portion of Logic Table 8-1 to provide nine (e.g., 3×3) different result combinations, corresponding to nine different logical operations, as indicated by the various connecting paths shown at 881. The nine different selectable logical operations that can be implemented by the sensing circuitry 724 are summarized in Logic Table 8-2.

The columns of Logic Table 8-2 show a heading 883 that includes the states of logic selection control signals (e.g., FF, FT, TF, TT). For example, the state of a first logic selection control signal (e.g., FF) is provided in the row 884, the state of a second logic selection control signal (e.g., FT) is provided in the row 885, the state of a third logic selection control signal (e.g., TF) is provided in the row 886, and the state of a fourth logic selection control signal (e.g., TT) is provided in the row 887. The particular logical operation corresponding to the results is summarized in the row 888.

It will be understood that when an element is referred to as being “on,” “connected to” or “coupled with” another element, it can be directly on, connected, or coupled with the other element or intervening elements may be present. In contrast, when an element is referred to as being “directly on,” “directly connected to” or “directly coupled with” another element, there are no intervening elements or layers present.

Although specific embodiments have been illustrated and described herein, those of ordinary skill in the art will appreciate that an arrangement calculated to achieve the same results can be substituted for the specific embodiments shown. This disclosure is intended to cover adaptations or variations of one or more embodiments of the present disclosure. It is to be understood that the above description has been made in an illustrative fashion, and not a restrictive one. Combination of the above embodiments, and other embodiments not specifically described herein will be apparent to those of skill in the art upon reviewing the above description. The scope of the one or more embodiments of the present disclosure includes other applications in which the above structures and methods are used. Therefore, the scope of one or more embodiments of the present disclosure should be determined with reference to the appended claims, along with the full range of equivalents to which such claims are entitled.

In the foregoing Detailed Description, some features are grouped together in a single embodiment for the purpose of streamlining the disclosure. This method of disclosure is not to be interpreted as reflecting an intention that the disclosed embodiments of the present disclosure have to use more features than are expressly recited in each claim. Rather, as the following claims reflect, inventive subject matter lies in less than all features of a single disclosed embodiment. Thus, the following claims are hereby incorporated into the Detailed Description, with each claim standing on its own as a separate embodiment. 

What is claimed is:
 1. A method, comprising: receiving a user definition of a memory shape including: a quantity of contiguous columns of a memory array; a quantity of contiguous rows of the memory array; and a major dimension of the memory shape, wherein the major dimension corresponds to a dimension by which to initially stride data stored in memory cells coupled to the contiguous columns and contiguous rows of the memory array; and allocating a multidimensional, contiguous, physical portion of a memory array according to the user definition.
 2. The method of claim 1, further comprising storing a first data element and a second data element in memory cells of the memory array corresponding to the memory shape.
 3. The method of claim 2, further comprising performing an operation on the first data element or the second data element using sensing circuitry coupled to the memory array.
 4. The method of claim 1, wherein allocating the multidimensional, contiguous, physical portion comprises allocating the multidimensional, contiguous, physical portion of a single physical memory component of the memory array.
 5. A method, comprising: allocating a plurality of contiguous memory cells of a memory array, wherein the plurality of memory cells correspond to a user-defined quantity of contiguous columns and a user-defined quantity of contiguous rows of the memory array; and storing a data element in at least a portion of the plurality of memory cells.
 6. The method of claim 5, wherein storing the data element comprises: storing a first data element of a first length; and storing a second data element of a second length, wherein the first length is different than the second length.
 7. The method of claim 6, further comprising storing padding to a different portion of the plurality of memory cells, wherein a length of the padding is equal to a difference between the first length and the second length.
 8. The method of claim 7, further comprising: storing the first data element in a first portion of the plurality of memory cells, wherein the first data element is of a first type; and storing the second data element in a second portion of the plurality of memory cells, wherein the second data element is of a second type, wherein the first type is different than the second type.
 9. The method of claim 8, further comprising: storing the first data element in the first portion, wherein the first type is an integer; and storing the second data element in the second portion, wherein the second type is a floating point or a string.
 10. The method of claim 8, further comprising: storing the first data element in the first portion, wherein the first type is a string; and storing the second data element in the second portion, wherein the second type is a floating point or an integer.
 11. The method of claim 6, further comprising: storing only the first data element in a first group of the plurality of memory cells of a respective first column of the memory shape; and subsequently storing only the second data element in a second group of the plurality of memory cells coupled to a respective second column of the memory shape, wherein the respective first column is adjacent to the respective second column.
 12. The method of claim 6, further comprising: storing only the first data element in a first group of the plurality of memory cells of a respective first row of the memory shape; and subsequently storing only the second data element in a second group of the plurality of memory cells coupled to a respective second row of the memory shape, wherein the respective first row is adjacent to the respective second row.
 13. A method, comprising: receiving a user definition of a memory shape; receiving a user definition of a quantity of the memory shapes; and allocating contiguous columns and contiguous rows of memory cells of a memory array according to the user definitions.
 14. The method of claim 13, further comprising mapping existing data to the memory shapes.
 15. The method of claim 14, wherein mapping the existing data comprises mapping the existing data from memory other than the memory array to the memory shapes.
 16. The method of claim 14, wherein mapping the existing data comprises mapping the existing data from the memory array to the memory shapes.
 17. An apparatus, comprising: a memory device; and a host coupled to the memory device, wherein the host is configured to: receive a user definition of a memory shape; receive a user definition of a quantity of the memory shapes; allocate contiguous columns and contiguous rows of memory cells of a single physical memory component of the memory device according to the user definitions; and store a plurality of data elements contiguously in the single physical memory component according to the user definitions.
 18. The apparatus of claim 17, wherein the single physical memory component is a single memory bank.
 19. The apparatus of claim 17, wherein the host is configured to allocate the contiguous columns and contiguous rows of memory cells of the single physical memory component such that each of the memory shapes comprises memory cells coupled to common access lines.
 20. The apparatus of claim 17, further comprising sensing circuitry coupled to the single physical memory component, wherein the sensing circuitry is configured to perform an operation on at least one of the plurality of data elements.
 21. The apparatus of claim 20, wherein the sensing circuitry is configured to: perform the operation on a first data element of a first one of the memory shapes; and perform the operation on a second data element of a second one of the memory shapes.
 22. The apparatus of claim 20, wherein the sensing circuitry is configured to: perform the operation on a first data element of a particular one of the memory shapes; and perform the operation on a second data element of the particular one of the memory shapes.
 23. The apparatus of claim 20, wherein the sensing circuitry is configured to perform the operation on the plurality of data elements concurrently.
 24. The apparatus of claim 20, wherein the host is configured to address each memory shape individually such that the operation is performed on a portion of the plurality data elements stored in particular memory shape.
 25. The apparatus of claim 24, wherein the host is configured to address each memory shape with a vector style address.
 26. The apparatus of claim 17, wherein the host includes a memory allocation application program interface (API) configured to receive the user definitions.
 27. A non-transitory computer readable medium storing instructions executable by a processing resource to: receive a user-defined quantity of contiguous rows of a memory shape and a user-defined quantity of contiguous columns of the memory shape; receive a user-defined quantity of memory shapes; allocate a contiguous, multidimensional portion of a single physical memory component of a memory device according to the user-defined quantities; store a plurality of data elements in the contiguous, multidimensional portion such that the plurality of data elements are in a common orientation; and perform an operation on the plurality of data elements according to a user-defined sequence.
 28. The medium of claim 27, further comprising instructions to: perform the operation on each of the plurality of data elements of a first memory shape; and subsequently perform the operation on each of the plurality of data elements of a second memory shape.
 29. The medium of claim 28, further comprising instructions to: store a respective one of the plurality of data elements in each of the contiguous columns; perform the operation on a data element of a first column of the first memory shape; subsequently perform the operation on a data element of a second column of the first memory shape; subsequently perform the operation on a data element of a first column of the second memory shape; and subsequently perform the operation on a data element of a second column of the second memory shape.
 30. The medium of claim 28, further comprising instructions to: store a respective one of the plurality of data elements in each of the contiguous rows; perform the operation on a data element of a first row of the first memory shape; subsequently perform the operation on a data element of a second row of the first memory shape; subsequently perform the operation on a data element of a first row of the second memory shape; and subsequently perform the operation on a data element of a second row of the second memory shape. 